منابع مشابه
A Tutte polynomial for signed graphs
This paper introduces a generalization of the Tutte polynomial [14] that is defined for signed graphs. A signed graph is a graph whose edges are each labelled with a sign (+l or 1). The generalized polynomial will be denoted Q[G] = Q[G](A, B, d). Here G is the signed graph, and the letters A, B, d denote three independent polynomial variables. The polynomial Q[G] can be specialized to the Tutte...
متن کاملTutte polynomial expansions for 2-separable graphs
Let Ĝ be a graph obtained from a graph G with no loops or coloops by replacing each edge e= uw of G by a connected graph He that has only the vertices u and w in common with the rest of Ĝ. Two mutually dual formulas are proved for the Tutte polynomial of Ĝ in terms of parameters of the graphs He and (in the one case) 0ow polynomials of subgraphs of G or (in the other case) tension polynomials o...
متن کاملThe Tutte Polynomial Characterizes Simple Outerplanar Graphs
We show that if G is a simple outerplanar graph and H is a graph with the same Tutte polynomial as G, then H is also outerplanar. Examples show that the condition of G being simple cannot be omitted.
متن کاملTutte Polynomial of Multi-Bridge Graphs
In this paper, using a well-known recursion for computing the Tutte polynomial of any graph, we found explicit formulae for the Tutte polynomials of any multi-bridge graph and some 2−tree graphs. Further, several recursive formulae for other graphs such as the fan and the wheel graphs are also discussed.
متن کاملThe Tutte polynomial for homeomorphism classes of graphs
We study a polynomial which contains, as special cases, the Tutte polynomials of all members of a given homeomorphism class of graphs. We further show that this polynomial can be directly derived from the chain polynomial introduced in [1]. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1989
ISSN: 0166-218X
DOI: 10.1016/0166-218x(89)90049-8